Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries : Logistics: From theory to applicationNAGY, Gabor; SALHI, Said.European journal of operational research. 2005, Vol 162, Num 1, pp 126-141, issn 0377-2217, 16 p.Conference Paper

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-completeBERBEGLIA, Gerardo; HAHN, Gena.Discrete applied mathematics. 2009, Vol 157, Num 11, pp 2541-2547, issn 0166-218X, 7 p.Article

A new insertion-based construction heuristic for solving the pickup and delivery problem with time windowsQUAN LU; DESSOUKY, Maged M.European journal of operational research. 2006, Vol 175, Num 2, pp 672-687, issn 0377-2217, 16 p.Article

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveriesWASSAN, Niaz A; WASSAN, A. Hameed; NAGY, Gabor et al.Journal of combinatorial optimization. 2008, Vol 15, Num 4, pp 368-386, issn 1382-6905, 19 p.Article

The vehicle routing problem with pickups and deliveries on some special graphsTZOREFF, Tali Eilam; GRANOT, Daniel; GRANOT, Frieda et al.Discrete applied mathematics. 2002, Vol 116, Num 3, pp 193-229, issn 0166-218XArticle

Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity AnalysisBERBEGLIA, Gerardo; PESANT, Gilles; ROUSSEAU, Louis-Martin et al.Transportation science. 2012, Vol 46, Num 3, pp 359-373, issn 0041-1655, 15 p.Article

The one-commodity pickup and delivery travelling salesman problem on a path or a treeFAN WANG; LIM, Andrew; ZHOU XU et al.Networks (New York, NY). 2006, Vol 48, Num 1, pp 24-35, issn 0028-3045, 12 p.Article

Branch and Cut and Price for the Pickup and Delivery Problem with Time WindowsROPKE, Stefan; CORDEAU, Jean-François.Transportation science. 2009, Vol 43, Num 3, pp 267-286, issn 0041-1655, 20 p.Article

Pickup and Delivery with Split LoadsNOWAK, Maciek; ERGUN, Ozlem; WHITE, Chelsea C et al.Transportation science. 2008, Vol 42, Num 1, pp 32-43, issn 0041-1655, 12 p.Article

On activity-based network design problemsJEE EUN KANG; CHOW, Joseph Y. J; RECKER, Will W et al.Transportation research. Part B : methodological. 2013, Vol 57, pp 398-418, issn 0191-2615, 21 p.Conference Paper

The heterogeneous pickup and delivery problem with configurable vehicle capacityYUAN QU; BARD, Jonathan F.Transportation research. Part C, Emerging technologies. 2013, Vol 32, pp 1-20, issn 0968-090X, 20 p.Conference Paper

Large-scale constrained clustering for rationalizing pickup and delivery operationsBARD, Jonathan F; JARRAH, Ahmad I.Transportation research. Part B : methodological. 2009, Vol 43, Num 5, pp 542-561, issn 0191-2615, 20 p.Article

Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery ProblemCORTES, Cristian E; SAEZ, Doris; NUNEZ, Alfredo et al.Transportation science. 2009, Vol 43, Num 1, pp 27-42, issn 0041-1655, 16 p.Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

On dynamic pickup and delivery vehicle routing with several time windows and waiting timesFABRI, A; RECHT, P.Transportation research. Part B : methodological. 2006, Vol 40, Num 4, pp 335-350, issn 0191-2615, 16 p.Article

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

Modeling the pickup-and-delivery Problem with structured graph transformation: A case studyKLEMPIEN-HINRICHS, Renate; KNIRSCH, Peter; KUSKE, Sabine et al.APPLIGRAPH workshop on applied graph transformationETAPS 2002 : European joint conference on theory and practice of software. Satellite workshop. 2002, pp 119-130Conference Paper

Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problemCHOW, Joseph Y. J; RECKER, Will W.Transportation research. Part B : methodological. 2012, Vol 46, Num 3, pp 463-479, issn 0191-2615, 17 p.Article

A nested decomposition approach for solving the paratransit vehicle scheduling problemKARABUK, Suleyman.Transportation research. Part B : methodological. 2009, Vol 43, Num 4, pp 448-465, issn 0191-2615, 18 p.Article

Integration of vehicle routing and resource allocation in a dynamic logistics networkHUTH, Thomas; MATTFELD, Dirk C.Transportation research. Part C, Emerging technologies. 2009, Vol 17, Num 2, pp 149-162, issn 0968-090X, 14 p.Article

A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resourcesLIN, C. K. Y.Computers & operations research. 2011, Vol 38, Num 11, pp 1596-1609, issn 0305-0548, 14 p.Article

A Branch-and-Bound Algorithm for the Double Travelling Salesman Problem with Two StacksCARRABS, Francesco; CERULLI, Raffaele; SPERANZA, Maria Grazia et al.Networks (New York, NY). 2013, Vol 61, Num 1, pp 58-75, issn 0028-3045, 18 p.Article

The One-Commodity Pickup-and-Delivery Traveling Salesman Problem : Inequalities and AlgorithmsHERNANDEZ-PEREZ, Hipolito; SALAZAR-GONZALEZ, Juan-José.Networks (New York, NY). 2007, Vol 50, Num 4, pp 258-272, issn 0028-3045, 15 p.Article

Saving-based algorithms for vehicle routing problem with simultaneous pickup and deliveryGAJPAL, Y; ABAD, P.The Journal of the Operational Research Society. 2010, Vol 61, Num 10, pp 1498-1509, issn 0160-5682, 12 p.Article

A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle casesPSARAFTIS, Harilaos N.European journal of operational research. 2011, Vol 215, Num 3, pp 572-580, issn 0377-2217, 9 p.Article